Optimized placement of symmetrical service function chain in network function virtualization

Network function virtualization (NFV) is one of the key technology enablers for actualizing 5G networks. With NFV, virtual network functions (VNFs) are linked together as a service chain (SFC), which provides functionality customer on demand. However, how to efficiently find suitable placement VNFs regarding given objectives an extremely difficult issue. The existing approaches assume that SFC has simple and asymmetrical pattern unsuitable modeling real system. We address this limitation by studying VNF optimization problem with symmetrical SFCs can support both symmetric asymmetric traffic flows. This NP-hard formulated mixed-integer linear programming (MILP) model. An iterative greedy-based heuristic proposed overcome complexity MILP Extensive simulation results show obtain near-optimal solution compared small-scale network, at same time, superior traditional large-scale network.